Flipping Plane Spanning Paths

نویسندگان

چکیده

Let S be a planar point set in general position, and let $$\mathcal {P}(S)$$ the of all plane straight-line paths with vertex S. A flip on path $$P \in \mathcal is operation replacing an edge e P another f to obtain new valid from . It long-standing open question whether for every given S, can transformed into any other by sequence flips. To achieve better understanding this question, we show that it sufficient prove statement spanning whose first fixed. Furthermore, provide positive answers special classes sets, namely, wheel sets generalized double circles (which include, e.g., chains circles).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

We consider the following question: How many edgedisjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?

متن کامل

Spanning paths in hypercubes

Given a family {ui, vi}i=1 of pairwise distinct vertices of the n-dimensional hypercube Qn such that the distance of ui and vi is odd and k ≤ n− 1, there exists a family {Pi}i=1 of paths such that ui and vi are the endvertices of Pi and {V (Pi)}i=1 partitions V (Qn). This holds for any n ≥ 2 with one exception in the case when n = k + 1 = 4. On the other hand, for any n ≥ 3 there exist n pairs ...

متن کامل

Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane

The spanning ratio and maximum detour of a graph G embedded in a metric space measure how well G approximates the minimum complete graph containing G and metric space, respectively. In this paper we show that computing the spanning ratio of a rectilinear path P in L1 space has a lower bound of Ω(n log n) in the algebraic computation tree model and describe a deterministic O(n log n) time algori...

متن کامل

Spanning paths in infinite planar graphs

Let G be a 4-connected infinite planar graph such that the deletion of any finite set of vertices of G results in at most one infinite component. We prove a conjecture of Nash-Williams that G has a 1-way infinite spanning path. c © 1996 John Wiley

متن کامل

On Spanning Disjoint Paths in Line Graphs

Spanning connectivity of graphs has been intensively investigated in the study of interconnection networks (Hsu and Lin, Graph Theory and Interconnection Networks, 2009). For a graph G and an integer s > 0 and for u, v ∈ V (G)with u = v, an (s; u, v)-path-system of G is a subgraph H consisting of s internally disjoint (u, v)paths. A graph G is spanning s-connected if for any u, v ∈ V (G) with u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-27051-2_5